Convergence Properties of Two (μ+λ) Evolutionary Algorithms on OneMax and Royal Roads Test Functions
نویسندگان
چکیده
We present a number of bounds on convergence time for two elitist population-based Evolutionary Algorithms using a recombination operator k-Bit-Swap and a mainstream Randomized Local Search algorithm. We study the effect of distribution of elite species and population size.
منابع مشابه
Convergence Properties of Two ({\mu} + {\lambda}) Evolutionary Algorithms On OneMax and Royal Roads Test Functions
We present a number of bounds on convergence time for two elitist population-based Evolutionary Algorithms using a recombination operator k-Bit-Swap and a mainstream Randomized Local Search algorithm. We study the effect of distribution of elite species and population size.
متن کاملA Lower Bound Analysis of Population-Based Evolutionary Algorithms for Pseudo-Boolean Functions
Evolutionary algorithms (EAs) are population-based general-purpose optimization algorithms, and have been successfully applied in various real-world optimization tasks. However, previous theoretical studies often employ EAs with only a parent or offspring population and focus on specific problems. Furthermore, they often only show upper bounds on the running time, while lower bounds are also ne...
متن کاملConvergence Properties of (μ + λ) Evolutionary Algorithms
Introduction Evolutionary Algorithms (EA) are a branch of heuristic population-based optimization tools that is growing in popularity (especially for combinatorial and other problems with poorly understood landscapes). Despite their many uses, there are no proofs that an EA will always converge to the global optimum for any general problem. Indeed, only for a set of trivial functions there are ...
متن کاملConvergence of a Recombination-Based Elitist Evolutionary Algorithm on the Royal Roads Test Function
We present an analysis of the performance of an elitist Evolutionary algorithm using a recombination operator known as 1-Bit-Swap on the Royal Roads test function based on a population. We derive complete, approximate and asymptotic convergence rates for the algorithm. The complete model shows the benefit of the size of the population and recombination pool.
متن کاملA General Dichotomy of Evolutionary Algorithms on Monotone Functions
It is known that the (1+1)-EA with mutation rate c/n optimises every monotone function efficiently if c < 1, and needs exponential time on some monotone functions (HotTopic functions) if c ≥ 2.2. We study the same question for a large variety of algorithms, particularly for (1 + λ)EA, (μ + 1)-EA, (μ + 1)-GA, their fast counterparts like fast (1 + 1)EA, and for (1 + (λ, λ))-GA. We find that all ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011